<!-- This comment will put IE 6, 7 and 8 in quirks mode -->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>include/shark/Algorithms/NearestNeighbors/TreeNearestNeighbors.h Source File</title>
<script type="text/javaScript" src="search/search.js"></script>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script src="https://polyfill.io/v3/polyfill.min.js?features=es6"></script>
<script id="MathJax-script" async src="https://cdn.jsdelivr.net/npm/mathjax@3.0.1/es5/tex-mml-chtml.js"></script>
<script src="../../mlstyle.js"></script>
<link href="../css/besser.css" rel="stylesheet" type="text/css"/>
</head>
<!-- pretty cool: each body gets an id tag which is the basename of the web page  -->
<!--              and allows for page-specific CSS. this is client-side scripted, -->
<!--              so the id will not yet show up in the served source code -->
<script type="text/javascript">
    jQuery(document).ready(function () {
        var url = jQuery(location).attr('href');
        var pname = url.substr(url.lastIndexOf("/")+1, url.lastIndexOf(".")-url.lastIndexOf("/")-1);
        jQuery('#this_url').html('<strong>' + pname + '</strong>');
        jQuery('body').attr('id', pname);
    });
</script>
<body>
    <div id="shark_old">
        <div id="wrap">
            <div id="header">
                <div id="site-name"><a href="../../sphinx_pages/build/html/index.html">Shark machine learning library</a></div>
                <ul id="nav">
                    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/installation.html">Installation</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/tutorials/tutorials.html">Tutorials</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/benchmark.html">Benchmarks</a>
                    </li>
                    <li class="active">
                        <a href="classes.html">Documentation</a>
                        <ul>
                            <li class="first"></li>
                            <li><a href="../../sphinx_pages/build/html/rest_sources/quickref/quickref.html">Quick references</a></li>
                            <li><a href="classes.html">Class list</a></li>
                            <li class="last"><a href="group__shark__globals.html">Global functions</a></li>
                        </ul>
                    </li>
                </ul>
            </div>
        </div>
    </div>
<div id="doxywrapper">
<!--
    <div id="global_doxytitle">Doxygen<br>Documentation:</div>
-->
    <div id="navrow_wrapper">
<!-- Generated by Doxygen 1.9.8 -->
<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_9d0c4981f10d03078bcfd5c74fe41ce8.html">shark</a></li><li class="navelem"><a class="el" href="dir_24fc231769ada4cfc8add7cd238ad0f8.html">Algorithms</a></li><li class="navelem"><a class="el" href="dir_a482eb5df5fa27105e42ee1edb09e59a.html">NearestNeighbors</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle"><div class="title">TreeNearestNeighbors.h</div></div>
</div><!--header-->
<div class="contents">
<a href="_tree_nearest_neighbors_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">//===========================================================================</span><span class="comment"></span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">/*!</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * </span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> *</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * \brief       Efficient Nearest neighbor queries.</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * </span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * </span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> *</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> * \author      T. Glasmachers</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * \date        2011</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> *</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> *</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> * \par Copyright 1995-2017 Shark Development Team</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> * </span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> * &lt;BR&gt;&lt;HR&gt;</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> * This file is part of Shark.</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> * &lt;https://shark-ml.github.io/Shark/&gt;</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"> * </span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> * Shark is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> * it under the terms of the GNU Lesser General Public License as published </span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> * by the Free Software Foundation, either version 3 of the License, or</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> * </span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> * Shark is distributed in the hope that it will be useful,</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> * GNU Lesser General Public License for more details.</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment"> * </span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment"> * You should have received a copy of the GNU Lesser General Public License</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment"> * along with Shark.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment"> *</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment"> */</span></div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="comment">//===========================================================================</span></div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#ifndef SHARK_ALGORITHMS_NEARESTNEIGHBORS_TREENEARESTNEIGHBORS_H</span></div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#define SHARK_ALGORITHMS_NEARESTNEIGHBORS_TREENEARESTNEIGHBORS_H</span></div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;boost/intrusive/rbtree.hpp&gt;</span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#include &lt;<a class="code" href="_binary_tree_8h.html" title="Binary space-partitioning tree of data points.">shark/Models/Trees/BinaryTree.h</a>&gt;</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;<a class="code" href="_abstract_nearest_neighbors_8h.html">shark/Algorithms/NearestNeighbors/AbstractNearestNeighbors.h</a>&gt;</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;<a class="code" href="_data_view_8h.html">shark/Data/DataView.h</a>&gt;</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceshark.html" title="AbstractMultiObjectiveOptimizer.">shark</a> {</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="comment"></span> </div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment">///</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="comment">/// \brief Iterative nearest neighbors query.</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="comment">///</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment">/// \par</span></div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment">/// The IterativeNNQuery class (Iterative Nearest Neighbor</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="comment">/// Query) allows the nearest neighbors of a reference point</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="comment">/// to be queried iteratively. Given the reference point, a</span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="comment">/// query is set up that returns the nearest neighbor first,</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="comment">/// then the second nearest neighbor, and so on.</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="comment">/// Thus, nearest neighbor queries are treated in an &quot;online&quot;</span></div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="comment">/// fashion. The algorithm follows the paper (generalized to</span></div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="comment">/// arbitrary space-partitioning trees):</span></div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="comment">///</span></div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="comment">/// \par</span></div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="comment">/// Strategies for efficient incremental nearest neighbor search.</span></div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="comment">/// A. J. Broder. Pattern Recognition 23(1/2), pp 171-178, 1990.</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="comment">///</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="comment">/// \par</span></div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="comment">/// The algorithm is based on traversing a BinaryTree that</span></div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="comment">/// partitions the space into nested cells. The triangle</span></div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="comment">/// inequality is applied to exclude cells from the search.</span></div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="comment">/// Furthermore, candidate points are cached in a queue,</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="comment">/// such that subsequent queries profit from points that</span></div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="comment">/// could not be excluded this way, but that did not turn</span></div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="comment">/// out the be the (current) nearest neighbor.</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="comment">///</span></div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="comment">/// \par</span></div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="comment">/// The tree must have a bucket size of one, but leaf nodes</span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="comment">/// with multiple copies of the same point are allowed.</span></div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="comment">/// This means that the space partitioning must be carried</span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="comment">/// out to the finest possible scale.</span></div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="comment">///</span></div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><span class="comment">/// The Data must be sotred in a random access container. This means that elements</span></div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="comment">/// have O(1) access time. This is crucial for the performance of the tree lookup.</span></div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="comment">/// When data is stored in a Data&lt;T&gt;, a View should be chosen as template parameter.</span></div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="comment"></span><span class="keyword">template</span> &lt;<span class="keyword">class</span> DataContainer&gt;</div>
<div class="foldopen" id="foldopen00082" data-start="{" data-end="};">
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="classshark_1_1_iterative_n_n_query.html">   82</a></span><span class="keyword">class </span><a class="code hl_class" href="classshark_1_1_iterative_n_n_query.html" title="Iterative nearest neighbors query.">IterativeNNQuery</a></div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>{</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> DataContainer::value_type value_type;</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keyword">typedef</span> <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">BinaryTree&lt;value_type&gt;</a> <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">tree_type</a>;</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keyword">typedef</span> <a class="code hl_class" href="classshark_1_1_abstract_kernel_function.html" title="Base class of all Kernel functions.">AbstractKernelFunction&lt;value_type&gt;</a> <a class="code hl_class" href="classshark_1_1_abstract_kernel_function.html" title="Base class of all Kernel functions.">kernel_type</a>;</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keyword">typedef</span> std::pair&lt;double, std::size_t&gt; result_type;</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span><span class="comment"></span> </div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span><span class="comment">    /// create a new query</span></div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span><span class="comment">    /// \param  tree    Underlying space-partitioning tree (this is assumed to persist for the lifetime of the query object).</span></div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span><span class="comment">    /// \param  data    Container holding the stored data which is referenced by the tree</span></div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="comment">    /// \param  point   Point whose nearest neighbors are to be found.</span></div>
<div class="foldopen" id="foldopen00094" data-start="{" data-end="}">
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"><a class="line" href="classshark_1_1_iterative_n_n_query.html#a02c6b80d059c5bd4964ed64a7420ede0">   94</a></span><span class="comment"></span>    <a class="code hl_function" href="classshark_1_1_iterative_n_n_query.html#a02c6b80d059c5bd4964ed64a7420ede0">IterativeNNQuery</a>(<a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">tree_type</a> <span class="keyword">const</span>* tree, DataContainer <span class="keyword">const</span>&amp; data, value_type <span class="keyword">const</span>&amp; point)</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    : m_data(data)</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    , m_reference(point)</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    , m_nextIndex(0)</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    , mp_trace(NULL)</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    , mep_head(NULL)</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    , m_squaredRadius(0.0)</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    , m_neighbors(0)</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    {</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="comment">// Initialize the recursion trace: descend to the</span></div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        <span class="comment">// leaf covering the reference point and queue it.</span></div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <span class="comment">// The parent of this leaf becomes the &quot;head&quot;.</span></div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        mp_trace = <span class="keyword">new</span> TraceNode(tree, NULL, m_reference);</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        TraceNode* tn = mp_trace;</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">while</span> (tree-&gt;<a class="code hl_function" href="classshark_1_1_binary_tree.html#a8d5379344624257a1c2950d4e64ab8c0">hasChildren</a>())</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        {</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            tn-&gt;createLeftNode(tree, m_data, m_reference);</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            tn-&gt;createRightNode(tree, m_data, m_reference);</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            <span class="keywordtype">bool</span> left = tree-&gt;<a class="code hl_function" href="classshark_1_1_binary_tree.html#a456c9994792021b1bb2557cad4ab7a3e">isLeft</a>(m_reference);</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>            tn = (left ? tn-&gt;mep_left : tn-&gt;mep_right);</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>            tree = (left ? tree-&gt;<a class="code hl_function" href="classshark_1_1_binary_tree.html#ae20385cf5cf85d7168db9b3fcf411c47" title="&quot;left&quot; sub-node of the binary tree">left</a>() : tree-&gt;<a class="code hl_function" href="classshark_1_1_binary_tree.html#ae5167564abb964d90da01897693a5768" title="&quot;right&quot; sub-node of the binary tree">right</a>());</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        }</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        mep_head = tn-&gt;mep_parent;</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        insertIntoQueue((TraceLeaf*)tn);</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        m_squaredRadius = mp_trace-&gt;squaredRadius(m_reference);</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    }</div>
</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span><span class="comment"></span> </div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="comment">    /// destroy the query object and its internal data structures</span></div>
<div class="foldopen" id="foldopen00122" data-start="{" data-end="}">
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"><a class="line" href="classshark_1_1_iterative_n_n_query.html#af4917cb856b7b71d313d42978793e011">  122</a></span><span class="comment"></span>    <a class="code hl_function" href="classshark_1_1_iterative_n_n_query.html#af4917cb856b7b71d313d42978793e011" title="destroy the query object and its internal data structures">~IterativeNNQuery</a>() {</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        m_queue.clear();</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        <span class="keyword">delete</span> mp_trace;</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    }</div>
</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span><span class="comment"></span> </div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span><span class="comment">    /// return the number of neighbors already found</span></div>
<div class="foldopen" id="foldopen00129" data-start="{" data-end="}">
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"><a class="line" href="classshark_1_1_iterative_n_n_query.html#a8eadbf00c36ad200cbb2d75efed07c7b">  129</a></span><span class="comment"></span>    std::size_t <a class="code hl_function" href="classshark_1_1_iterative_n_n_query.html#a8eadbf00c36ad200cbb2d75efed07c7b" title="return the number of neighbors already found">neighbors</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        <span class="keywordflow">return</span> m_neighbors;</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    }</div>
</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="comment"></span> </div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span><span class="comment">    /// find and return the next nearest neighbor</span></div>
<div class="foldopen" id="foldopen00134" data-start="{" data-end="}">
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"><a class="line" href="classshark_1_1_iterative_n_n_query.html#ac980e389bfdd03966ab9eee72491f520">  134</a></span><span class="comment"></span>    result_type <a class="code hl_function" href="classshark_1_1_iterative_n_n_query.html#ac980e389bfdd03966ab9eee72491f520" title="find and return the next nearest neighbor">next</a>() {</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        <a class="code hl_define" href="_exception_8h.html#adce1f80097c69010f5eab2618fa2e971">SHARK_RUNTIME_CHECK</a>(m_neighbors &lt; mp_trace-&gt;m_tree-&gt;size(), <span class="stringliteral">&quot;No more neighbors available&quot;</span>);</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        assert(! m_queue.empty());</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        <span class="comment">// Check whether the current node has points</span></div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        <span class="comment">// left, or whether it should be discarded.</span></div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        <span class="keywordflow">if</span> (m_neighbors &gt; 0){</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>            TraceLeaf&amp; q = *m_queue.begin();</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>            <span class="keywordflow">if</span> (m_nextIndex &lt; q.m_tree-&gt;size()){</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>                <span class="keywordflow">return</span> getNextPoint(q);</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>            }</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>            <span class="keywordflow">else</span></div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>                m_queue.erase(q);</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        }</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        <span class="keywordflow">if</span> (m_queue.empty() || (*m_queue.begin()).m_squaredPtDistance &gt; m_squaredRadius){</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>            <span class="comment">// enqueue more points</span></div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>            TraceNode* tn = mep_head;</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>            <span class="keywordflow">while</span> (tn != NULL){</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>                enqueue(tn);</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>                <span class="keywordflow">if</span> (tn-&gt;m_status == COMPLETE) mep_head = tn-&gt;mep_parent;</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>                tn = tn-&gt;mep_parent;</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>            }</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span> </div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>            <span class="comment">// re-compute the radius</span></div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>            m_squaredRadius = mp_trace-&gt;squaredRadius(m_reference);</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        }</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        m_nextIndex = 0;</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        ++m_neighbors;</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        <span class="keywordflow">return</span> getNextPoint(*m_queue.begin());</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    }</div>
</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span><span class="comment"></span> </div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span><span class="comment">    /// return the size of the queue,</span></div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span><span class="comment">    /// which is a measure of the</span></div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span><span class="comment">    /// overhead of the search</span></div>
<div class="foldopen" id="foldopen00169" data-start="{" data-end="}">
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"><a class="line" href="classshark_1_1_iterative_n_n_query.html#ac55c632054e204acc14e0b554320d9a9">  169</a></span><span class="comment"></span>    std::size_t <a class="code hl_function" href="classshark_1_1_iterative_n_n_query.html#ac55c632054e204acc14e0b554320d9a9">queuesize</a>()<span class="keyword"> const</span>{ </div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        <span class="keywordflow">return</span> m_queue.size();</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    }</div>
</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span> </div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span><span class="comment"></span> </div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span><span class="comment">    /// status of a TraceNode object during the search</span></div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span><span class="comment"></span>    <span class="keyword">enum</span> Status</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    {</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        NONE,            <span class="comment">// no points of this node have been queued yet</span></div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        PARTIAL,         <span class="comment">// some of the points of this node have been queued</span></div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        COMPLETE,        <span class="comment">// all points of this node have been queued</span></div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    };</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span><span class="comment"></span> </div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span><span class="comment">    /// The TraceNode class builds up a tree during</span></div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span><span class="comment">    /// the search. This tree covers only those parts</span></div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span><span class="comment">    /// of the space partirioning tree that need to be</span></div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span><span class="comment">    /// traversed in order to find the next nearest</span></div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span><span class="comment">    /// neighbor.</span></div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span><span class="comment"></span>    <span class="keyword">class </span>TraceNode</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    {</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    <span class="keyword">public</span>:<span class="comment"></span></div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span><span class="comment">        /// Constructor</span></div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span><span class="comment"></span>        TraceNode(tree_type <span class="keyword">const</span>* tree, TraceNode* parent, value_type <span class="keyword">const</span>&amp; reference)</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        : m_tree(tree)</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        , m_status(NONE)</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>        , mep_parent(parent)</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        , mep_left(NULL)</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        , mep_right(NULL)</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>        , m_squaredDistance(tree-&gt;squaredDistanceLowerBound(reference))</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        { }</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span><span class="comment"></span> </div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span><span class="comment">        /// Destructor</span></div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span><span class="comment"></span>        <span class="keyword">virtual</span> ~TraceNode()</div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        {</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>            <span class="keywordflow">if</span> (mep_left != NULL) <span class="keyword">delete</span> mep_left;</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>            <span class="keywordflow">if</span> (mep_right != NULL) <span class="keyword">delete</span> mep_right;</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>        }</div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>        </div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>        <span class="keywordtype">void</span> createLeftNode(tree_type <span class="keyword">const</span>* tree, DataContainer <span class="keyword">const</span>&amp; data, value_type <span class="keyword">const</span>&amp; reference){</div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>            <span class="keywordflow">if</span> (tree-&gt;left()-&gt;hasChildren())</div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>                mep_left = <span class="keyword">new</span> TraceNode(tree-&gt;left(), <span class="keyword">this</span>, reference);</div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>            <span class="keywordflow">else</span></div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>                mep_left = <span class="keyword">new</span> TraceLeaf(tree-&gt;left(), <span class="keyword">this</span>, data, reference);</div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>        }</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>        <span class="keywordtype">void</span> createRightNode(tree_type <span class="keyword">const</span>* tree, DataContainer <span class="keyword">const</span>&amp; data, value_type <span class="keyword">const</span>&amp; reference){</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>            <span class="keywordflow">if</span> (tree-&gt;right()-&gt;hasChildren())</div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>                mep_right = <span class="keyword">new</span> TraceNode(tree-&gt;right(), <span class="keyword">this</span>, reference);</div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>            <span class="keywordflow">else</span></div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>                mep_right = <span class="keyword">new</span> TraceLeaf(tree-&gt;right(), <span class="keyword">this</span>, data, reference);</div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>        }</div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span><span class="comment"></span> </div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span><span class="comment">        /// Compute the squared distance of the area not</span></div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span><span class="comment">        /// yet covered by the queue to the reference point.</span></div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span><span class="comment">        /// This is also referred to as the squared &quot;radius&quot;</span></div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span><span class="comment">        /// of the area covered by the queue (in fact, it is</span></div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span><span class="comment">        /// the radius of the largest sphere around the</span></div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span><span class="comment">        /// reference point that fits into the covered area).</span></div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span><span class="comment"></span>        <span class="keywordtype">double</span> squaredRadius(value_type <span class="keyword">const</span>&amp; ref)<span class="keyword"> const</span>{</div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>            <span class="keywordflow">if</span> (m_status == NONE) <span class="keywordflow">return</span> m_squaredDistance;</div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (m_status == PARTIAL)</div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>            {</div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>                <span class="keywordtype">double</span> l = mep_left-&gt;squaredRadius(ref);</div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>                <span class="keywordtype">double</span> r = mep_right-&gt;squaredRadius(ref);</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>                <span class="keywordflow">return</span> std::min(l, r);</div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>            }</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>            <span class="keywordflow">else</span> <span class="keywordflow">return</span> 1e100;</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>        }</div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span><span class="comment"></span> </div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span><span class="comment">        /// node of the tree</span></div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span><span class="comment"></span>        tree_type <span class="keyword">const</span>* m_tree;</div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span><span class="comment"></span> </div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span><span class="comment">        /// status of the search</span></div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span><span class="comment"></span>        Status m_status;</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span><span class="comment"></span> </div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span><span class="comment">        /// parent node</span></div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span><span class="comment"></span>        TraceNode* mep_parent;</div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span><span class="comment"></span> </div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span><span class="comment">        /// &quot;left&quot; child</span></div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span><span class="comment"></span>        TraceNode* mep_left;</div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span><span class="comment"></span> </div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span><span class="comment">        /// &quot;right&quot; child</span></div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span><span class="comment"></span>        TraceNode* mep_right;</div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span><span class="comment"></span> </div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span><span class="comment">        /// squared distance of the box to the reference point</span></div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span><span class="comment"></span>        <span class="keywordtype">double</span> m_squaredDistance;</div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    };</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span><span class="comment"></span> </div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span><span class="comment">    /// hook type for intrusive container</span></div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span><span class="comment"></span>    <span class="keyword">typedef</span> boost::intrusive::set_base_hook&lt;&gt; HookType;</div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span><span class="comment"></span> </div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span><span class="comment">    /// Leaves of the three have three roles:</span></div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span><span class="comment">    /// (1) they are tree nodes holding exactly one point</span></div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span><span class="comment">    ///     (possibly multiple copies of this point),</span></div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span><span class="comment">    /// (2) they know the distance of their point to the</span></div>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span><span class="comment">    ///     reference point,</span></div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span><span class="comment">    /// (3) they can be added to the candidates queue.</span></div>
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span><span class="comment"></span>    <span class="keyword">class </span>TraceLeaf : <span class="keyword">public</span> TraceNode, <span class="keyword">public</span> HookType</div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    {</div>
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    <span class="keyword">public</span>:<span class="comment"></span></div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span><span class="comment">        /// Constructor</span></div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span><span class="comment"></span>        TraceLeaf(tree_type <span class="keyword">const</span>* tree, TraceNode* parent, DataContainer <span class="keyword">const</span>&amp; data, value_type <span class="keyword">const</span>&amp; ref)</div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>        : TraceNode(tree, parent, ref){</div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>            <span class="comment">//check whether the tree uses a differen metric than a linear one.</span></div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>            <span class="keywordflow">if</span>(tree-&gt;kernel() != NULL)</div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>                m_squaredPtDistance = tree-&gt;kernel()-&gt;featureDistanceSqr(data[tree-&gt;index(0)], ref);</div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>            <span class="keywordflow">else</span></div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>                m_squaredPtDistance = distanceSqr(data[tree-&gt;index(0)], ref);</div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>        }</div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span><span class="comment"></span> </div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span><span class="comment">        /// Destructor</span></div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span><span class="comment"></span>        ~TraceLeaf() { }</div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span> </div>
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span><span class="comment"></span> </div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span><span class="comment">        /// Comparison by distance, ties are broken arbitrarily,</span></div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span><span class="comment">        /// but deterministically, by tree node pointer.</span></div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span><span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> operator &lt; (TraceLeaf <span class="keyword">const</span>&amp; rhs)<span class="keyword"> const</span>{</div>
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>            <span class="keywordflow">if</span> (m_squaredPtDistance == rhs.m_squaredPtDistance) </div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>                <span class="keywordflow">return</span> (this-&gt;m_tree &lt; rhs.m_tree);</div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>            <span class="keywordflow">else</span></div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>                <span class="keywordflow">return</span> (m_squaredPtDistance &lt; rhs.m_squaredPtDistance);</div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>        }</div>
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span><span class="comment"></span> </div>
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span><span class="comment">        /// Squared distance of the single point in the leaf to the reference point.</span></div>
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span><span class="comment"></span>        <span class="keywordtype">double</span> m_squaredPtDistance;</div>
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>    };</div>
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span><span class="comment"></span> </div>
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span><span class="comment">    /// insert a point into the queue</span></div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span><span class="comment"></span>    <span class="keywordtype">void</span> insertIntoQueue(TraceLeaf* leaf){</div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>        m_queue.insert_unique(*leaf);</div>
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span> </div>
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>        <span class="comment">// traverse up the tree, updating the state</span></div>
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>        TraceNode* tn = leaf;</div>
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>        tn-&gt;m_status = COMPLETE;</div>
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>        <span class="keywordflow">while</span> (<span class="keyword">true</span>){</div>
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>            TraceNode* par = tn-&gt;mep_parent;</div>
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>            <span class="keywordflow">if</span> (par == NULL) <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>            <span class="keywordflow">if</span> (par-&gt;m_status == NONE){</div>
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>                par-&gt;m_status = PARTIAL;</div>
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>                <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>            }</div>
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (par-&gt;m_status == PARTIAL){</div>
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>                <span class="keywordflow">if</span> (par-&gt;mep_left == tn){</div>
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>                    <span class="keywordflow">if</span> (par-&gt;mep_right-&gt;m_status == COMPLETE) par-&gt;m_status = COMPLETE;</div>
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>                    <span class="keywordflow">else</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>                }</div>
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>                <span class="keywordflow">else</span>{</div>
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>                    <span class="keywordflow">if</span> (par-&gt;mep_left-&gt;m_status == COMPLETE) par-&gt;m_status = COMPLETE;</div>
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>                    <span class="keywordflow">else</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>                }</div>
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>            }</div>
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>            tn = par;</div>
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>        }</div>
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>    }</div>
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span> </div>
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    result_type getNextPoint(TraceLeaf <span class="keyword">const</span>&amp; leaf){</div>
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>        <span class="keywordtype">double</span> dist = std::sqrt(leaf.m_squaredPtDistance);</div>
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>        std::size_t index = leaf.m_tree-&gt;index(m_nextIndex);</div>
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>        ++m_nextIndex;</div>
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>        <span class="keywordflow">return</span> std::make_pair(dist,index);</div>
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>    }</div>
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span><span class="comment"></span> </div>
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span><span class="comment">    /// Recursively descend the node and enqueue</span></div>
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span><span class="comment">    /// all points in cells intersecting the</span></div>
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span><span class="comment">    /// current bounding sphere.</span></div>
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span><span class="comment"></span>    <span class="keywordtype">void</span> enqueue(TraceNode* tn){</div>
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>        <span class="comment">// check whether this node needs to be enqueued</span></div>
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>        <span class="keywordflow">if</span> (tn-&gt;m_status == COMPLETE) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>        <span class="keywordflow">if</span> (! m_queue.empty() &amp;&amp; tn-&gt;m_squaredDistance &gt;= (*m_queue.begin()).m_squaredPtDistance) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span> </div>
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>        <span class="keyword">const</span> tree_type* tree = tn-&gt;m_tree;</div>
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>        <span class="keywordflow">if</span> (tree-&gt;hasChildren()){</div>
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>            <span class="comment">// extend the tree at need</span></div>
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>            <span class="keywordflow">if</span> (tn-&gt;mep_left == NULL){</div>
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>                tn-&gt;createLeftNode(tree,m_data,m_reference);</div>
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>            }</div>
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>            <span class="keywordflow">if</span> (tn-&gt;mep_right == NULL){</div>
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>                tn-&gt;createRightNode(tree,m_data,m_reference);</div>
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>            }</div>
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span> </div>
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>            <span class="comment">// first descend into the closer sub-tree</span></div>
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>            <span class="keywordflow">if</span> (tree-&gt;isLeft(m_reference))</div>
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>            {</div>
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>                <span class="comment">// left first</span></div>
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>                enqueue(tn-&gt;mep_left);</div>
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>                enqueue(tn-&gt;mep_right);</div>
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>            }</div>
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>            <span class="keywordflow">else</span></div>
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>            {</div>
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>                <span class="comment">// right first</span></div>
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>                enqueue(tn-&gt;mep_right);</div>
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>                enqueue(tn-&gt;mep_left);</div>
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>            }</div>
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>        }</div>
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>        <span class="keywordflow">else</span></div>
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>        {</div>
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>            TraceLeaf* leaf = (TraceLeaf*)tn;</div>
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>            insertIntoQueue(leaf);</div>
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>        }</div>
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>    }</div>
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span><span class="comment"></span> </div>
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span><span class="comment">    /// the queue is a self-balancing tree of sorted entries</span></div>
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span><span class="comment"></span>    <span class="keyword">typedef</span> boost::intrusive::rbtree&lt;TraceLeaf&gt; QueueType;</div>
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span> </div>
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span><span class="comment"></span> </div>
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span><span class="comment">    ///\brief Datastorage to lookup the points referenced by the space partitioning tree.</span></div>
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span><span class="comment"></span>    DataContainer <span class="keyword">const</span>&amp; m_data;</div>
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span><span class="comment"></span> </div>
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span><span class="comment">    /// reference point for this query</span></div>
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span><span class="comment"></span>    value_type m_reference;</div>
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span><span class="comment"></span> </div>
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span><span class="comment">    /// queue of candidates</span></div>
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span><span class="comment"></span>    QueueType m_queue;</div>
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span><span class="comment"></span> </div>
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span><span class="comment">    /// index of the next not yet returned element</span></div>
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span><span class="comment">    /// of the current leaf.</span></div>
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span><span class="comment"></span>    std::size_t m_nextIndex;</div>
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span><span class="comment"></span> </div>
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span><span class="comment">    /// recursion trace tree</span></div>
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span><span class="comment"></span>    TraceNode* mp_trace;</div>
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span><span class="comment"></span> </div>
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span><span class="comment">    /// &quot;head&quot; of the trace tree. This is the</span></div>
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span><span class="comment">    /// node containing the reference point,</span></div>
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span><span class="comment">    /// but so high up in the tree that it is</span></div>
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span><span class="comment">    /// not fully queued yet.</span></div>
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span><span class="comment"></span>    TraceNode* mep_head;</div>
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span><span class="comment"></span> </div>
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span><span class="comment">    /// squared radius of the &quot;covered&quot; area</span></div>
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span><span class="comment"></span>    <span class="keywordtype">double</span> m_squaredRadius;</div>
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span><span class="comment"></span> </div>
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span><span class="comment">    /// number of neighbors already returned</span></div>
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span><span class="comment"></span>    std::size_t m_neighbors;</div>
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>};</div>
</div>
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span> </div>
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span><span class="comment"></span> </div>
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span><span class="comment">///\brief Nearest Neighbors implementation using binary trees</span></div>
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span><span class="comment">///</span></div>
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span><span class="comment">/// Returns the labels and distances of the k nearest neighbors of a point.</span></div>
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span><span class="comment"></span><span class="keyword">template</span>&lt;<span class="keyword">class</span> InputType, <span class="keyword">class</span> LabelType&gt;</div>
<div class="foldopen" id="foldopen00408" data-start="{" data-end="};">
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_nearest_neighbors.html">  408</a></span><span class="keyword">class </span><a class="code hl_class" href="classshark_1_1_tree_nearest_neighbors.html" title="Nearest Neighbors implementation using binary trees.">TreeNearestNeighbors</a>:<span class="keyword">public</span> <a class="code hl_class" href="classshark_1_1_abstract_nearest_neighbors.html" title="Interface for Nearest Neighbor queries.">AbstractNearestNeighbors</a>&lt;InputType,LabelType&gt;</div>
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>{</div>
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>    <span class="keyword">typedef</span> <a class="code hl_class" href="classshark_1_1_abstract_nearest_neighbors.html" title="Interface for Nearest Neighbor queries.">AbstractNearestNeighbors&lt;InputType,LabelType&gt;</a> <a class="code hl_class" href="classshark_1_1_abstract_nearest_neighbors.html" title="Interface for Nearest Neighbor queries.">base_type</a>;</div>
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span> </div>
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_nearest_neighbors.html#a81535a6dc1129bf3b9c5db033706ee7d">  414</a></span>    <span class="keyword">typedef</span> <a class="code hl_class" href="classshark_1_1_labeled_data.html" title="Data set for supervised learning.">LabeledData&lt;InputType, LabelType&gt;</a> <a class="code hl_typedef" href="classshark_1_1_tree_nearest_neighbors.html#a81535a6dc1129bf3b9c5db033706ee7d">Dataset</a>;</div>
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_nearest_neighbors.html#a963f6592ded4228aa2a34366b4b5bf15">  415</a></span>    <span class="keyword">typedef</span> <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">BinaryTree&lt;InputType&gt;</a> <a class="code hl_typedef" href="classshark_1_1_tree_nearest_neighbors.html#a963f6592ded4228aa2a34366b4b5bf15">Tree</a>;</div>
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_nearest_neighbors.html#ad884ac010262866e0fbc13878d7fc0b4">  416</a></span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code hl_struct" href="structshark_1_1_key_value_pair.html" title="Represents a Key-Value-Pair similar std::pair which is strictly ordered by it&#39;s key.">base_type::DistancePair</a> <a class="code hl_typedef" href="classshark_1_1_tree_nearest_neighbors.html#ad884ac010262866e0fbc13878d7fc0b4">DistancePair</a>;</div>
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_nearest_neighbors.html#a00707a24f04878d9c64546366e3cccea">  417</a></span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code hl_struct" href="structshark_1_1_batch.html" title="class which helps using different batch types">Batch&lt;InputType&gt;::type</a> <a class="code hl_typedef" href="classshark_1_1_tree_nearest_neighbors.html#a00707a24f04878d9c64546366e3cccea">BatchInputType</a>;</div>
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span> </div>
<div class="foldopen" id="foldopen00419" data-start="{" data-end="}">
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_nearest_neighbors.html#ad3c362695b3ab2d2ac28934e7901a98c">  419</a></span>    <a class="code hl_function" href="classshark_1_1_tree_nearest_neighbors.html#ad3c362695b3ab2d2ac28934e7901a98c">TreeNearestNeighbors</a>(<a class="code hl_class" href="classshark_1_1_labeled_data.html">Dataset</a> <span class="keyword">const</span>&amp; <a class="code hl_function" href="classshark_1_1_tree_nearest_neighbors.html#a05eda57f90ea8bbb9c1fbe773a7075e6" title="returns a const reference to the dataset used by the algorithm">dataset</a>, <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">Tree</a> <span class="keyword">const</span>* tree)</div>
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>    : m_dataset(<a class="code hl_function" href="classshark_1_1_tree_nearest_neighbors.html#a05eda57f90ea8bbb9c1fbe773a7075e6" title="returns a const reference to the dataset used by the algorithm">dataset</a>)</div>
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>    , m_inputs(<a class="code hl_function" href="classshark_1_1_tree_nearest_neighbors.html#a05eda57f90ea8bbb9c1fbe773a7075e6" title="returns a const reference to the dataset used by the algorithm">dataset</a>.inputs())</div>
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>    , m_labels(<a class="code hl_function" href="classshark_1_1_tree_nearest_neighbors.html#a05eda57f90ea8bbb9c1fbe773a7075e6" title="returns a const reference to the dataset used by the algorithm">dataset</a>.labels())</div>
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>    , mep_tree(tree)</div>
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>    {</div>
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span>        this-&gt;<a class="code hl_variable" href="classshark_1_1_abstract_nearest_neighbors.html#a71d274e64e2eff7e1f72fa4fe3fb3473">m_inputShape</a> = dataset.<a class="code hl_function" href="group__shark__globals.html#ga134d41e34c69c494346367a570bf4ff8" title="Returns the Shape of the inputs.">inputShape</a>();</div>
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>    }</div>
</div>
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span><span class="comment"></span> </div>
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span><span class="comment">    ///\brief returns the k nearest neighbors of the point</span></div>
<div class="foldopen" id="foldopen00429" data-start="{" data-end="}">
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_nearest_neighbors.html#a93240024a5a340943a32c46c88347648">  429</a></span><span class="comment"></span>    std::vector&lt;DistancePair&gt; <a class="code hl_function" href="classshark_1_1_tree_nearest_neighbors.html#a93240024a5a340943a32c46c88347648" title="returns the k nearest neighbors of the point">getNeighbors</a>(<a class="code hl_typedef" href="classshark_1_1_tree_nearest_neighbors.html#a00707a24f04878d9c64546366e3cccea">BatchInputType</a> <span class="keyword">const</span>&amp; patterns, std::size_t k)<span class="keyword">const</span>{</div>
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>        std::size_t numPoints = <a class="code hl_function" href="namespaceshark.html#af2ab10364feb8a631e0866dcf2f1a4ad">batchSize</a>(patterns);</div>
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>        std::vector&lt;DistancePair&gt; results(k*numPoints);</div>
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>        <span class="keywordflow">for</span>(std::size_t p = 0; p != numPoints; ++p){</div>
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>            <a class="code hl_class" href="classshark_1_1_iterative_n_n_query.html" title="Iterative nearest neighbors query.">IterativeNNQuery&lt;DataView&lt;Data&lt;InputType&gt;</a> <span class="keyword">const</span>&gt; &gt; query(mep_tree, m_inputs, row(patterns, p));</div>
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>            <span class="comment">//find the neighbors using the queries</span></div>
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>            <span class="keywordflow">for</span>(std::size_t i = 0; i != k; ++i){</div>
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>                <span class="keyword">typename</span> <a class="code hl_class" href="classshark_1_1_iterative_n_n_query.html" title="Iterative nearest neighbors query.">IterativeNNQuery&lt;DataView&lt;Data&lt;InputType&gt;</a> <span class="keyword">const</span>&gt; &gt;::result_type result = query.<a class="code hl_function" href="classshark_1_1_iterative_n_n_query.html#ac980e389bfdd03966ab9eee72491f520" title="find and return the next nearest neighbor">next</a>();</div>
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>                results[i+p*k].key=result.first;</div>
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>                results[i+p*k].value= m_labels[result.second]; </div>
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>            }</div>
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>        }</div>
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>        <span class="keywordflow">return</span> results;</div>
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>    }</div>
</div>
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span> </div>
<div class="foldopen" id="foldopen00444" data-start="{" data-end="}">
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"><a class="line" href="classshark_1_1_tree_nearest_neighbors.html#a05eda57f90ea8bbb9c1fbe773a7075e6">  444</a></span>    <a class="code hl_class" href="classshark_1_1_labeled_data.html" title="Data set for supervised learning.">LabeledData&lt;InputType,LabelType&gt;</a><span class="keyword">const</span>&amp; <a class="code hl_function" href="classshark_1_1_tree_nearest_neighbors.html#a05eda57f90ea8bbb9c1fbe773a7075e6" title="returns a const reference to the dataset used by the algorithm">dataset</a>()<span class="keyword">const </span>{</div>
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>        <span class="keywordflow">return</span> m_dataset;</div>
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>    }</div>
</div>
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span> </div>
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>    <a class="code hl_typedef" href="classshark_1_1_tree_nearest_neighbors.html#a81535a6dc1129bf3b9c5db033706ee7d">Dataset</a> <span class="keyword">const</span>&amp; m_dataset;</div>
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>    <a class="code hl_class" href="classshark_1_1_data_view.html" title="Constant time Element-Lookup for Datasets.">DataView&lt;Data&lt;InputType&gt;</a> <span class="keyword">const</span>&gt; m_inputs;</div>
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>    <a class="code hl_class" href="classshark_1_1_data_view.html" title="Constant time Element-Lookup for Datasets.">DataView&lt;Data&lt;LabelType&gt;</a> <span class="keyword">const</span>&gt; m_labels;</div>
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>    <a class="code hl_typedef" href="classshark_1_1_tree_nearest_neighbors.html#a963f6592ded4228aa2a34366b4b5bf15">Tree</a> <span class="keyword">const</span>* mep_tree;</div>
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>    </div>
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>};</div>
</div>
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span> </div>
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span> </div>
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>}</div>
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span><span class="preprocessor">#endif</span></div>
</div><!-- fragment --></div><!-- contents -->
</div>
</body>
</html>
